Secure Multiparty Computation and Secret Sharing - An Information Theoretic Appoach
نویسندگان
چکیده
منابع مشابه
Design and formal verification of DZMBE+
In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...
متن کاملStatistical Multiparty Computation Based on Random Walks on Graphs
With respect to a special class of access structures based on connectivity of graphs, we start from a linear secret sharing scheme and turn it into a secret sharing scheme with perfect security and exponentially small error probability by randomizing the reconstruction algorithm through random walks on graphs. It reduces the polynomial work space to logarithmic. Then we build the corresponding ...
متن کاملCollusion Deterrence in Multi-Party Computation – An Evolutionary Game-Theoretic Approach
Many secure multiparty computation (SMC) protocols use Shamir’s Secret Sharing (SSS) scheme as a building block. A weakness of SSS is the possibility of collusion attacks among parties. Despite the shortcoming, SSS requires no data expansion and achieves information-theoretic security compared to other cryptographic SMC techniques such as garbled circuits. Moreover, it is much faster than other...
متن کاملKey Technologies and Applications of Secure Multiparty Computation
With the advent of the information age, the network security is particularly important. The secure multiparty computation is a very important branch of cryptography. It is a hotspot in the field of information security. It expanded the scope of the traditional distributed computing and information security, provided a new computing model for the network collaborative computing. First we introdu...
متن کاملConditionally Secure Secrecy Computation using Secret Sharing Scheme for n<2k-1 (full paper)
Typically, when secrecy multiplication is performed in multiparty computation using Shamir’s (k, n) threshold secret sharing scheme, the result is a polynomial with degree of 2k − 2 instead of k − 1. This causes a problem where, in order to reconstruct a multiplication result, the number of polynomials needed will increase from k to 2k − 1. Shingu et al. proposed a method to solve the problem t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012